Deciding Fuzzy Description Logics by Type Elimination

نویسندگان

  • Uwe Keller
  • Stijn Heymans
چکیده

We present a novel procedure FixIt(ALC) for deciding knowledge base satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured models as in tableau-based proof procedures, but embodies a fixpoint-computation of canonical models that are not necessarily tree-structured. Conceptually, the procedure is based on a type-elimination process. Soundness, completeness and termination are proven. To the best of our knowledge it is the first fixpoint-based decision procedure for FDLs, hence introducing a new class of inference procedures into FDL reasoning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How Fuzzy Is My Fuzzy Description Logic?

Fuzzy Description Logics (DLs) with t-norm semantics have been studied as a means for representing and reasoning with vague knowledge. Recent work has shown that even fairly inexpressive fuzzy DLs become undecidable for a wide variety of t-norms. We complement those results by providing a class of t-norms and an expressive fuzzy DL for which ontology consistency is linearly reducible to crisp r...

متن کامل

Consistency reasoning in lattice-based fuzzy Description Logics

Fuzzy Description Logics have been widely studied as a formalism for representing and reasoning withvague knowledge. One of the most basic reasoning tasks in (fuzzy) Description Logics is to decide whetheran ontology representing a knowledge domain is consistent. Surprisingly, not much is known about thecomplexity of this problem for semantics based on complete De Morgan lattices. T...

متن کامل

Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web∗

We present a novel approach to fuzzy description logic programs (or simply fuzzy dl-programs) under the answer set semantics, which is a tight integration of fuzzy disjunctive logic programs under the answer set semantics with fuzzy description logics. From a different perspective, it is a generalization of tightly coupled disjunctive dl-programs by fuzzy vagueness in both the description logic...

متن کامل

Fuzzy description logics under Gödel semantics

Classical ontologies are not suitable to represent vague pieces of information, which has lead to the birth of Fuzzy Description Logics as an appropriate formalism to represent this type of knowledge. Different families of fuzzy operators lead to Fuzzy Description Logics with different properties. This paper studies Fuzzy Description Logics under a semantics given by the Gödel family of fuzzy o...

متن کامل

Reasoning in Fuzzy Description Logics using Automata

Automata-based methods have been successfully employed to prove tight complexity bounds for reasoning in many classical logics, and in particular in Description Logics (DLs). Very recently, the ideas behind these automata-based approaches were adapted for reasoning also in fuzzy extensions of DLs, with semantics based either on finitely many truth degrees or the Gödel t-norm over the interval [...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008